Optimized Indirect Binary
نویسندگان
چکیده
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs (e.g. disk data). The term \indirect" indicates that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk databases that are indexed using the suux array model (also called pat array). We consider the cost model of magnetic and optical disks and the anticipated knowledge of the expected size of the subproblem produced by reading each disk track. This information is used to devise a modiied binary searching algorithm to reduce overall retrieval costs. Both an optimal and a practical algorithm are presented, together with analytical and some experimental results, showing that standard binary search can be improved by 50% or more.
منابع مشابه
Optimized Indirect Binary Search and Text Retrieval (preliminary Version)
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs (e.g. disk data). The term \indirect" indicates that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk databases that are indexed using the suux arr...
متن کاملA Comparison Between GA and PSO Algorithms in Training ANN to Predict the Refractive Index of Binary Liquid Solutions
A total of 1099 data points consisting of alcohol-alcohol, alcohol-alkane, alkane-alkane, alcohol-amine and acid-acid binary solutions were collected from scientific literature to develop an appropriate artificial neural network (ANN) model. Temperature, molecular weight of the pure components, mole fraction of one component and the structural groups of the components were used as input paramet...
متن کاملOptimized Binary Search and Text Retrieval 1 Eduardo
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk databases that are indexed using the suux ar...
متن کاملOptimized Binary Search and Text Retrieval
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk databases that are indexed using the suux ar...
متن کامل